A Small Expansion

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large Mass Expansion versus Small Momentum Expansion of Feynman Diagrams

The method of the large mass expansion (LME) has the technical advantage that two-loop integrals occur only as bubbles with large masses. In many cases only one large mass occurs. In such cases these integrals are expressible in terms of Γfunctions, i.e. they can be handled completely analytically avoiding even recursions and therefore this approach may find a wide field of application. We cons...

متن کامل

On Set Expansion Problems and the Small Set Expansion Conjecture

We study two problems related to the Small Set Expansion Conjecture [14]: the Maximum weight m′-edge cover (MWEC ) problem and the Fixed cost minimum edge cover (FCEC ) problem. In the MWEC problem, we are given an undirected simple graph G = (V,E) with integral vertex weights. The goal is to select a set U ⊆ V of maximum weight so that the number of edges with at least one endpoint in U is at ...

متن کامل

On Set Expansion Problems and the Small Set Expansion

We study two problems related to the Small Set Expansion Conjecture [15]: the Maximum weight m′-edge cover (MWEC) problem and the Fixed cost minimum edge cover (FCEC) problem. In the MWEC problem, we are given an undirected simple graph G = (V,E) with integral vertex weights. The goal is to select a set U ⊆ V of maximum weight so that the number of edges with at least one endpoint in U is at mo...

متن کامل

Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion

The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined as the minimum over all cuts in the hypergraph of the ratio of the number of the hyperedges cut to the size of the smaller side of the cut. We study the Hypergraph Small Set Expansion problem, which, for a parameter δ ∈ (0, 1/2], asks to compute the cut having the least expansion while having at ...

متن کامل

Markov chain methods for small-set expansion

Consider a finite irreducible Markov chain with invariant distribution π. We use the inner product induced by π and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set expansion problem. For example, Steurer showed a tight connection between the number of small eigenvalues of a graph’s Laplacian and the expansion of small sets in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Small

سال: 2021

ISSN: ['1613-6829', '1613-6810']

DOI: https://doi.org/10.1002/smll.202007408